Technical Note—A Note on Waiting Times in Single Server Queues
نویسندگان
چکیده
منابع مشابه
Technical Note - A Note on Waiting Times in Single Server Queues
EVANS, R. V. 1981. Markov Chain Design Problems. Opns. Res. 29, 959-970. KUMIN, H. J. 1973. On Characterizing the Extrema of a Function of Two Variables, One of Which Is Discrete. Mgmt. Sci. 20, 126-129. MILLER, B. 1971. On Minimizing Nonseparable Functions Defined on the Integers With an Inventory Application. SIAM J. Apple. Math. 2 1, 166-185. ROLFE, A. 1971. A Note on Marginal Allocation in ...
متن کاملWaiting times in queueing networks with a single shared server
We study a queueing network with a single shared server that serves the queues in a cyclic order. External customers arrive at the queues according to independent Poisson processes. After completing service, a customer either leaves the system or is routed to another queue. This model is very generic and finds many applications in computer systems, communication networks, manufacturing systems,...
متن کاملWaiting times in queues with relative priorities
This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter. © 2006 Elsevier B.V. All rights reserved.
متن کاملA note on Infinite-Server Markov modulated and Single-Server retrial Queues
We reconsider the M/M/∞ queue with two-state Markov modulated arrival and service processes and the singleserver retrial queue analyzed in Keilson and Servi [1]. Fuhrmann and Cooper type stochastic decomposition holds for the stationary occupancy distributions in both queues ([1] and [2]). The main contribution of the present paper is the derivation of the explicit form of the stationary system...
متن کاملHeavy-traffic Limits for Waiting times in Many-server Queues with Abandonment1 by Rishi Talreja
We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiency-driven (QED) regime, then a bounding argument shows that the abandonment does not affect waiting-time processes. If instead the system is overloaded, as in the efficiency-driven (ED) regime, fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1983
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.31.5.950